//Tue Sep 20 15:54:05 CDT 2011
import java.util.*;
import java.util.regex.*;
import java.text.*;
import java.math.*;
import java.awt.geom.*;

public class NumberofFiboCalls
{
	public int cost[][];
	public int[] fiboCallsMade(int n)
	{
		cost = new int[2][n+1];
		for(int i=0; i<=n; i++){
			cost[0][i] = -1;
			cost[1][i] = -1;
		}
		solve(n);
		int[] ret = new int[2];
		ret[0] = cost[0][n];
		ret[1] = cost[1][n];

		return ret;
	}
	
	public void solve(int x){
		if(x == 0){
			cost[0][0] = 1;
			cost[1][0] = 0;
		}
		if(x == 1){
			cost[0][1] = 0;
			cost[1][1] = 1;
		}
		if(cost[0][x] != -1 && cost[1][x] != -1)
			return;
		solve(x-1);
		solve(x-2);
		cost[0][x] = cost[0][x-1] + cost[0][x-2];
		cost[1][x] = cost[1][x-1] + cost[1][x-2];
		return;
	}
	
	
}
//Powered by [KawigiEdit] 2.0!
